New bivariate Hensel lifting algorithm for n factors
نویسندگان
چکیده
منابع مشابه
Sharp precision in Hensel lifting for bivariate polynomial factorization
Popularized by Zassenhaus in the seventies, several algorithms for factoring polynomials use a so-called lifting and recombination scheme. Concerning bivariate polynomials, we present a new algorithm for the recombination stage that requires a lifting up to precision twice the total degree of the polynomial to be factored. Its cost is dominated by the computation of reduced echelon solution bas...
متن کاملHensel lifting and bivariate polynomial factorisation over finite fields
This paper presents an average time analysis of a Hensel lifting based factorisation algorithm for bivariate polynomials over finite fields. It is shown that the average running time is almost linear in the input size. This explains why the Hensel lifting technique is fast in practice for most polynomials.
متن کاملNewton-Hensel Interpolation Lifting
The main result of this paper is a new version of Newton-Hensel lifting that relates to interpolation questions. It allows one to lift polynomials in Z[x] from information modulo a prime number p 6= 2 to a power pk for any k , and its originality is that it is a mixed version that not only lifts the coefficients of the polynomial but also its exponents. We show that this result corresponds exac...
متن کاملSparse Hensel Lifting
A new algorithm is introduced which computes the multivariate leading coefficients of polynomial factors from their univariate images. This algorithm is incorporated into a sparse Hensel lifting scheme and only requires the factorization of a single univariate image. The algorithm also provides the content of the input polynomial in the main variable as a by-product. We show how we can take adv...
متن کاملResolving zero-divisors using Hensel lifting
Algorithms which compute modulo triangular sets must respect the presence of zero-divisors. We present Hensel lifting as a tool for dealing with them. We give an application: a modular algorithm for computing GCDs of univariate polynomials with coefficients modulo a radical triangular set overQ. Our modular algorithm naturally generalizes previous work from algebraic number theory. We have impl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Communications in Computer Algebra
سال: 2019
ISSN: 1932-2240
DOI: 10.1145/3377006.3377021